Stored program control with memory work area assignment in a communication switching system

ABSTRACT

The executive or operating system for the central processor schedules tasks to be performed for call processing and maintenance. A call history table in the main core memory has an individual area for each register junctor for information relating to a call being processed. Work areas are assigned for tasks to be performed, with linkage to the call history table. The call history table also has linkages to work areas being used for each call.

United States Patent Kalat et al. 5) Oct. 28 1975 1 i STORED PROGRAM CONTROL WITH [56] References Cited MEMQRY WORK AREA ASSIGNMENT IN A UNITED STATES PATENTS COMMUNICATION SWITCHING SYSTEM 3.53b.842 10/1970 Ewin et all. I79]! 8 EA [75] inventors: Charles A. Kalal; Eugene A. Wodka, 3.576.398 4/1971 Dcjcan et at. lW/lti EA both of Schaumburg; Ambrose W. W. Clay, Glen Ellyn; Phil R. Harrington. Mount Prospect, all of ill.

U.S. C1 179/18 ES Int. Cl. H04Q 3/54 Field of Search l79ll8 ES, l8 EB. 18 EA REGISTE JUNCTORS Primary Examiner-Thomas We Brown 57 ABSTRACT The executive or operating system for the central processor schedules tasks to be performed for call pro' cessing and maintenance. A call history table in the main core memory has an individual area for each regisler junctor for information relating to a call being processed. Work areas are assigned for tasks to be performed. with linkage to the call history table, The call historytable also has linkages to work areas being used for each call.

5 Claims, 244 Drawing Figures .msznt JUNCT DEVICE MAINYENANCK O BUFFER CONYROt. uN l CENTRAL MAIN CONE MEMORY PROCESSOR CON ROL US. Patent 01.1.28, 1975 Shce14of205 3,916,112

CALL HISTORY TABLE CONTENTS DURING TIME FRAME o WORD O 2 l l I b.

WORDI ll 1 WOW 1 1 1 1 1 1 1 1 1 1 1'1 1 1 1 1! 000 CHATYP 'cHALKc WORD 3 I I I I I I I I l I I I I I1 I I I I l I 000 CHAARTCHAELN CHANPG WORD 4 1/111141111111111114 3 CHATPF WORD 5 I U 1 1/ 1 1 1 1 1 1 1 1 1 1 1 -1 1 If CHAFEL "35 00 E CHAFPR CHAERP WORD 5 U 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 000 CHAL'O CHARJ! WORD 7 I I I I I I I I I I I I I I I I I I I I CHOTMF cuaccm CHAWAA W01? D 8 1 20 I514 1 1 1 1 1 1 1 1 m 3 1n 1 0: m 1 B E E 3: 91 c S E cuouw: cuorov cucms WORD 9 o gw g i ussuulucu 111 1 111 4 e CHCCB'P CHCBUA cncmo E 5 01165513 WORD 10 D) CHCLMI CHCRVOCHC/WO WORD H E l I I I I I I I I I I I I I I l l I I TIME FRAME 0 IS DEFINED FOR PROGRAMS.

FIG. 7

Sheet 5 of 205 FRAME} Oct. 28, 1975 ouamc 111111:

CALL HISTORY TABLE CONTENTS US. Patent 0 1 2 3 4 5 6 8 9 w H D D D D D D D D D D D R R R R R R R R R R R m m 0 0 0 O 0 0 0 O 0 v v w w w w w w w w w l r.- l. l J 1 CO I. I M l W T NU C G J m P l. J MMVVV 1 M W m mrpuzu m 1 f c m 323 w. A 1 C T w 5326 1 G A S W 1 A 1 1 the? 1 usd c uomaru 1 1 fl 930. .1 1 E W L T 1 m 933 2 0.596. m 1 /1 A 5 64: E J 2533 M m. N c 4 c t c t u 1 1 1 2 C m 1 1 m A 1 11 l.. 1 2 H 2 m 1 N L 1 U M D 95526 C 0N R C M l K I l c 323 mzkozw/ M toru $226 @156 mm w R226 PROGRAMS RUN DURING TIME FRAMEi US. Patent o1.2s,1975 Shcel 6of205 3,916,112

CALL HISTORY TABLE CONTENTS 8 DURING TIME FRAME 2 12115 cm: c115 c115 CHE CHE x01 xpz x03 x04 x05 X06 WORD 0 CH6 c115 Q TIP FTP WORD1 /CHGNJR I l l I 1 l l l l 1 l l l l l CHELNI cuemrx 22g cwcaurv CHEAUI WORDZ 1 1 1 1 1 1 1 1 1 11 1 1 1 N Q CJAON! 8 g 1-; 0.11105 CJATGI WORD 4 q q rcu q 5 5 w 1 1 1 1 U 1 1 1 1 1 1 CJMOS mm (1 E cJAMRr g E CJAZCL g CJARCL WORD 5 q 1 1 1 I CJAINT w U 1 1 1 1 1 1 1 1 1 1 1 6'? if 3 CMMTP CJAET'N E CJASGI WORD 5 I "A 11 1111111111111 1- I:1 k S n: E woRo 7 I I a: I I I u U u l CHOTMF CHACCM CHAWAA WORD 8 o. 1 1 1 1: m F 4 n O 0: tr o -1 Q m 1 1 r: I 1 g g g g o o CHOLWA CHQTOV CHOTIC V1 0RD 9 I I I I I 2: I I I I u u U U L) 0 U U u U 1 l 1 2 a 8 2 CHOTKR cnoauw 5 n: E 5? Q CHCSSB WORD 1O 0 Q 0 0 q o 0 I I I I I I I 1 1 1 1 U P 1 u 1 Q 1 1 k m 5 g CHCLMI CHOPDL cucnuo WORD H O I I U U 1 1 14 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 T11141 FRAME 2 1s DEFINED FOR PROGRAMS F51, C04, 8 cos.

Sheet 7 of 205 Oct. 28, 1975 CALL HISTORY TABLE CONTENTS DURING TIME FRAME3 PROGRAMS RUN DURING TIME FRAME 3 C06, C08, C12, C13, C10 (1 PART OF C15) 0 l 2 3 4 5 6 7 8 9 w H D D D D D D D D D M R M W R R R R R R R R O O O O 0 O O O O O O O W W W W W W W W W W W W 1 1 1 1 1 L 1 1 1 E w. 1 oamuxw 1 G M 1 M W l .M M 1 1 U 1 1 1 1 H S 1 1 1 m N 1 c O 1 C P 1 1 M 1 1 1 1 W m m l U I. l l C c I I N 1 1 1 M 1 1 1 v ////7 EmozN m l w 6 m l. G R 1 W I I 1 w EZQUIU m 1 M 1 w F m. w 1 3536 1 1 M 1 1 W 239$ 1 m 1 w 4 1 w 1 M 1 c 1 1 .EG M 1 GNQG m. 1 R 1 M 1 M E35 1 monxu a n 1 2836 c 1 c 1 w 1 w 1 1835 w x @338 1 1 M 1 W 855 1 635 1 852d 9538 1 c c Q0505 1 J 1 E52. N 1 c R 1 20.53 1 v 1 .n 1 w 1 l T E55 1 m G916 R 1 .5356 3.65 m 1 m N236 m 1 1 A 6mozu 55 L 1 1. J 1 C F 126 C M @2620 N 1 H 1 5 1 5 0 c 1 4556 c @326 w C 1 1 u R N 1 1 1 1 1 29:6 M 4205 m 1 1 1m 3 c2 M 2 1 1 m 2.85 a 58:. m 1 M m 1 1 2596 R 356 1 .5098 mm 1 c 1 M M w A m $86 1 c2 1 c C W 5:65 5026 H H 1 5346 5135/ c mowozu c stQG muzozu US. Patent US. Patent 011.212.1975 91111119111205 3,916,112

CALI. HISTORY TABLE CONTENTS FIGII DURING TIME FRAME 5 O I D D D D D D D D D D D D R R R R R R R R R R R R O O O O O O O O O O O O W W W W W W W W W W W W 10 0 0 m 9 0 110 0 0 E 0 0 1 1 w m l l l 1. l I I l 11 T l l H 11 I. .1 I. l 11 l. I 11 11 H www- 2C 1 1 w 1 1 m. 1 m 1 1 1 3 c 3 a 3 m 1 1 H u 1 m 4 v m N I 1 w 1 1 w 1 H 1 1 m @2028 5 w r 1 1 1 1 1 c 1 M A 0 23266 M 7 7 7 mm M W 7 M 1 H I 11 1 .1 C 11 l 1. 1 A H I H A P A 1. I C L E1511? 3.3 H S H w .l .l I. Q 1/ c 1| II c 1! L I. 1 u 1 1 1 V 11 1 1 1 Q Bmoru 1 11. w 1 1 n 833 "$23 0 H 1 w Q Q H 1 1 m m m 58:5 w $5.6 1:651 1 w 0 1 1 m m M B B :33 B 3. .6:. FEES T 1 1 1 w 1 m m 538 m 9:310 E zzu m m .8510 m 1 U 1 1 a 1 w 1 6 M m m mmmzzu m 5 49165 E65 6 1 1 1. m c m E25 .6 255m w 1 H 1 1 H 1 1 1 r u M 7 u 1 1 C 1 C 1 11 I 1. H52: m I R326 8 1 1|! 1 1 1 a w E A w 2205 M 1 .2135 B 1 1 w. 1 w .111 U m w w 2296 w c 1 1 2 1 1 1 1 w 1 m H w n s w 2 3626 R 56. 1 a 1 1 1 1 1 1 1 1 m 1% W 1 Aws.2 m 13 1 13 1 2 H a V/ m E515 2605 c 2 a 2 a BQSG mmxqzua c 8 w @396 (c525 PROGRAMS WHICH RUN DURING TIME FRAME 5 C24, C26 RETRIAL PROGRAMS.

US. Patent Oct. 28, 1975 Sheet 10 of 205 3,916,112

c4 11 HISTORY 11101.5 coma-ms DURING TIME FRAME 6 g CHLCL2 I: CHLTCT cmmm WORD 0 I 1 1 I U l l 1 1 1 14 1 1 1 1 1 1 1 1 1 e5 19 1: 11 0 011101.: WORD! I I I I I I I I I I I I I I I I I l I I l 1 23 a r o cmcpg CHHSTI WORD 2 I I I I I I I I I I l I I I I I I I I I I I CHLCDI WORD-3 1 l1 l 1 1 151,5 1' II 1 1 1 1 1 111 0 01 01114513 3 2 3040s wars: WORD 4 5 5 q 2.31111111 P 11T1111111Q S U) 3 can MRT CHHS T2 WORD 5 I q U 11' 1 1111111 m E [L g CHLTSG f, crmscr WORD 6 I 5221 1I8I7I6I5UI3|2 1 11111110 G. k X F 2' E m E 2 CHLTSB 3 g g g cmmmv WORD 7 2 I: I z I I 4 11 1 H1111111||| CHOTMF CHA CCM CHAWAA WORDB 11 Q1111l5I4|111111111111 S 00000000 5000000000000000 WORDS I 23111 11176UI41 1 1 111 CHQTKR o L Q o 0- E C: 5%: 5 9, CHCBUN E, E g E g 8'; g cncssa WORD I0 I! I- O O o O o I I I I I 3: I: 569|1us 9 r q Uu 3 g 8; WORD n 3 8 CHCLME CHOPDL cncnuo I I UU2'11111111|1111|1551 1 11 PROGRAM C26 PUTS THE CALL HISTORY TABLE INTO THIS CONDITION BEFORE INSTRUCTING THE R5 TO CLEAR ITS MEMORY.

TIME FRAME 6 IS THE RJIDLE TIME FRAME AND IS SUCCEEDED BY TIME FRAME 0 WHEN THE RJ BEGINS TO PROCESS A NEW CALL.

US. Patent 0:.28,197s Shcctl1 of205 3,916,112

EXECUTIVE PROGRAM 1 1 I I I I 1 PRO E ING TICKETING METERING U T DEBUGGINGI] AW ENANCE UPDATE 7' CHNI UE PROGRAM PROGRAM PROGRAM PROGRAM PROGRAM PROGRZM l l I l I 5 DATA BASE F I 6. l3 FIELD moamm BLOCK omannu FLOW CHART PROGRAMS PA TCH AREA can: LAYOUT /////j/$PARE////// BRANCH AND PROGRAMS STORE-ENTRY LINE LUCA TION PATCH A REA CONSTAN T DATA PARAMETER onm VAR/ABLE 04m (WORK NON RESIDENT AREA FIG l4 TYPICAL com-.- LAYOUT WORD 23 I4 0 15 T ADDRESS OFFIRST worm OF 0 FIRST 5mm INITHEOUEUE (Fsr F I 6. l5 23 I5 (4 0 W505 ROOT I noonsss OFFIRST wane OF FORM, [LAST ENTRY IN msousunusr) 2 NUMBER OF ENTRIES IN THE OUEUE (CCTI 3 TOTAL ENTRIES THATII AY S BEEN LINKED TO OUEUE US. Patent 00. 28, 1975 Sheet 12 of 205 3,916,112

ousus ROOT IST ENTRY anqggg 1; fl/A 0023! F5? aozsH/Aza] 04/04 00350 L57 0 CURRENT coum's cor F1516 THREE ENTRY ouzuz WORD? 21 20 15 I4 0 I'JOF'I. AREA TYPE 0 m0r0ATO/i (TYP) LINK ADDRESS 23 2/20v I817 I514 0 PRIORITY zz lgr I (PRU 31 NEXT PROGRAM IDENTITWNPG) (EL/V) 2a 2120 I817 15/4 0 F/G.17 my FORMAT 2 {NINE THIS PROGRAM 105mm (TPF) FOR THE FIRST (TEL) H s/x H0805 23 2! 20 I817 I514 0 OF A 4 WORK hJOR/fj F0..... AREA 3 OFFOMED FORCED EXIT PROGRAM on ERROR EXIT mosrmm IDENTIIWFEP an ERP) T011 2 I ERROR INDICATOR /FROI.1THE 5x50, REGISTER JUVCTOR IDENTITY (9.1!)

5 CALL HISTORY TABLE pamrsmcur) 05mm LINK TASK WORK AREA ACCEPT T0 6/ mis 55 E F 2x 1 F04 x01 0 0 RETURN T0 CALLER OBTAIN WORK AREA FOR ERROR MESSAGE F04 XOI UNLINK msx FROM THE CP 1 00505 Fd 3X0l LOCATEAND REMOVE TASK FROM OR OUEUE E4276 X O2 RES/(ED RELOAD TIME RELOAD-ENTR (EOIXO-V) TIME LINK TASK TO OR OUL'UE FOZXQI RESKED- 5mm um: EOIXOG LINK TASK C. OUEUE FO2X03 Y LINE 601x655 OBTAIN WORK AREA TO SCHEDULE L469 FO4XO! SCHEDULE WATCH DOG IMER MANIPUZIA TOR (L4CD VIA ACCEPT EOIXOI I 7 MANJP L ATOR TO SCHEDULED PROGRA M DATA D MANIPULATO FSSXOI 1 FIG, |8 TIME- ENTRY LINE /xa 4 LOCATE AND REMOVE ENTRY LOCATE ENTRY EOE/JO! REMOVE ENTRY FROM QUEUE EGG/W 2 USED FOR I"-"' TIMER OUEUE ONLY '--fi.

LOCA TE ENTRY RENO VE ENTR Y USED ONLY OUEUE 23 5f BY uvrss ngc n no QUE U5 EOGXOS Fwsxml NORMAL HE TURN TO CALLER FIQZO ousus INTERROS/ITICN MODULE US. Patent 0m. 28, 1975 Sheet 14 of 205 3,916,112

LINK To 64 CK LINK m mom 0F OUEUE 0F OUEUL' ummx (FamxyD (ma/v53) Fwsxwl r LINK TO UNLINK OUEUE mom OUEUE F072 I F03 RETURN TO (ERROR REIT/RID GURU/1L RETURN CALLER T0 CALLER T0 CALLER DROP 4 F04X0/ W R R IJ REA ORKAREA LINK wonx WORK AREA "RETURN AREA r0 ASSIGNMENT FR O IyEZPARE m5 SP GJE E gUEUE 0 mam I 1 AN L CALLER WORK gf/gggff 0 E HANDLE AREA RETURN T OVERLOAD AVILABLE C. FIG. 9 6352??? 0 CALLE 0 CALLER HOT SENSE LINE FINDER TTYUSE' REQUEST INTERRUPT PROCfiESSOR WORK OBTAIN WA FOR 5 F4X' SCHEDULE m6 VIA ACCEPT- m I x 0 I MAINTENANCE TTY INPUT REQUEST INTERRUPT CAUSE AND 7 ANALYSIS [NIT/A TED FROM MCC RETURN TO CA LLER CAP MODULE FIG. 2| (LEVEL 1 mrsmwpr) GET MANIAC INFO LOOXO? S YSTEM CLEAR AND START L16 TRAP rwo CAUSE ANALYSIS RETURN TO CALLER) LEVEL TWO TRAP PROCESSOR MODULE REGISTER 5 TA Caf/NG (5/1 VE AND RES TORE I MAN/AC PA RITY PROGRAM U.S. Patent 0m. 28, 1975 CHECK Sheet 15 of 205 mum/Ir ccx ERRORS m'rmmr 53mm FrIm'm MP0 "-71"; LTVELP4T can R EA A I CIA! T 15110..555'

I 1 r FROM E24 mrsnraupr I ,521

max 0.4 HANDLER E F52 8 If I RfiJ j n I TIO-V F33 x01 ACCEPT can I 501x01 suan ounrxss CCR HANDLER FJZA FIG. 22

CCR SUBRgUTIIIES F3 8 MAKE-CO7? 1 mos Lw/ms LEVEL 3 INTERRUPT FROM E23 EVERY I667ms 0m cow L22X07 .REAL TIME CLOCK INTERVAL TIMER car 1mm: mI-L-fi FOR IIOIJZILES scuscuzm B7 nggg r MODULE [70/ [/0 TIMEOUT AUDIT NON-RESIDENT AREA AUDIT Q (RETURN TO E23 FIG. 25 INTERVAL msm mrsnnupr PROCESSOR MOD ULE ENTERED FROM E0 4 EVERY SECOND INCREI-IENT UNITS COUNTER E05 A OI IIICIIEIJEN T TENS FIG. 24

COUNTER El!) 5 A02 HETU-TIN r0 new REAL TIME CLOCK 1.100015 mm [:9 r r/ SCIILIJL LEI? LI II cumin azm1r1--- noun US. Patent OCL28,1975 Sheet 16 of 205 3,916,112

F0 R RE TURN FOR REL IL'OU/SH/NG T0 CALLER cor/m0". TD ExEcUnvE EOZXOI EOZXUJ'J 3 c3 INTEm AL 26 fi t jil L' sT INTER VAL A 665! TDR TI M ER E02 RRRA ETURN TO M MODULE R cALLER EOIX04 ENTERfD FROM E04 WHEN cALLED WHEN A PREvmUsLY GENERAL INTERVAL REQUESTED TIN/r1815 To cDUNTER l5 ZEIiO 8E ABORTED REUD vE E/RsT EGJSXLDI ENTRY 0F TLNER DUEUE RETURN WORK cArE/R mol" AREA 70 SPARE- "Hfflfi LTI'JIMER DJEUE T 55 51 HANDLER ENTRIES EDa E06X03 igHfDhl Lf max D5 9 ENE 15 OFJIJUSL'D gg fl t 53 BY WITH ENTgY L/RE F03 VIA 503 X 2 AccEPT 501x01 RETURN T0 RETURN TO F G 27 ED 4 CALLER I INTERVAL TIMER HANDLER NDDULE cALL pRDcEssmc WRITE MAINTENANCE READ/WRITE REDLsTER-EENDER REa/sTER- ig gy INTE ()CK sENDER FM mix I A cDEss I If) N DULE RE TUN T0 cA LL 0 0RD: T/DN cA L L ER ANALYs/s c2 9 CALLED BY CALL CALLED BY MAINTENANCE PROCESS/H6 VIA FUN) FOR R5 PROGRAMS VIA F03 F04? RS INTERLOCK WHEN RS AND INTERLOCK WHEN CLJLI'SLOT RJ CHECKS ARE TO BEMADE CHECK IS TO BE MADE Cw GEE) REG/S TER-5 ENDER TIMING INTERLOCK F D l REGISTER-SENDER TIMING INTERLOCK MODULE U.S. Patent TIME ECU/MP4 C "3 i OBTAIN [KM m4 WORK Oct. 28, 1975 AREA SSIGNMENT Sheet 17 of 205 ACCEPT SCHEDULES Em/XM P sen/vs ALL 8 QUEUES UNLINK WORK A REA FROM OUEUE AREA FROM UNL/HK L40 WORK RETURN WORK AREA L40X DI E0lx3 E 1x4 4 RESET RELEASE CCP R$CANS WATCH 00a con/mm. OF ALL 8 TIMER L 4 0 QUEUES F05Xd7l REMOVE HlGHESJ' PRIOR/TY TASK FROM OUEUE WA F 153X (I11 A ND PASS colvmoL r0 THA T PROGRAM r0 swam/L50 PROGRAM DRUM sfi fifl "c5551 5 N HcR/z/Js F4 0 x an F4 6 X 02 F4@ {Q3 METER/N6 m PROGRAMS w rasx 0/ X 0/1 14 DROP Eg 2mg MAN/PULATOR now A REA F; F3 5 F0 5 A: dJ/

MA IN TENANCE LINK r0 PROGRAMS FRONT OF OUEU F29x0/ 30 I F4) 2 x 2 EXECUTIVE 0!? IM 0mm %,?5575 SCQEbULER V HANDLER m6 F m 7) 29 F m L INK r0 5 15 K 0/: ACCEPT 00505 6011M)! M 2 x 0/ TIME runs FM; 3| 5111414 w/mw DRUM MEMORY SYSTEM [/0 OPERATIONS 

1. In a communication switching system including a switching network having a plurality of terminals, a plurality of line circuits individually connecting communication lines to individual ones of said terminals, a plurality of register junctors individually connected to other of said terminals, marker means to independently find idle paths and establish connections through said network between terminals and to detect originating call requests from calling line circuits and for each call request to select and establish an originating connection for the call to an idle register junctor, a register subsystem including the register junctors with means to receive and store call digits for each call, a data processing unit which includes a central processor and a central processor memory for processing call data, data communication means interconnecting the data processing unit with the marker means, data transfer means interconnecting the data processing unit with the register subsystem, the marker means being effective after said originating connection between a calling line circuit and a register junctor has been selected to seize the data communication means and transmits an originating data message identifying the calling line circuit and register junctor terminals to the central processor, the register subsystem including individual storage means for each register junctor for storing said call digits and other information relating to a call, a method of storing information, comprising: providing the central processor memory with a portion thereof designated a call history table with individual storage areas for each register junctor; storing information in the call history table for the register junctor indicating that a call has been initiated in response to the receipt of said originating data message; finding class of service information relating to the calling line to be used in processing the call; transmitting control information via the data transfer means from the central processor for storage in the storage means for the register junctor, to indicate that a call as been initiated and to provide processing information to prepare to receive called number digits; providing the central processor memory with a plurality of areas designated as woRk areas; assigning work areas to a call during different processing steps thereof, a first work area being assigned to a call in response to receipt of said originating data message; and storing information both in the call history table and in the assigned first work area to link them both by identifying the said first work area in the call history table and by identifying the part of the call history table for the register junctor in the said first work area.
 2. In a communication switching system a method as claimed in claim 1, further including releasing said first work area after initial call processing for the call in the data processing unit; said system further including at least one register sub-system sense line coupled from the register subsystem to the data processing unit, said register subsystem including a register memory comprising a plurality of register word stores, wherein said individual storage means for each register junctor comprises a given number of the register word stores for each register junctor, including control word stores and called number digit word stores, and wherein the register memory also includes common word stores, one of which is a service request word store, the register subsystem being responsive to given conditions requiring further processing by the data processing unit to generate service request signals and to apply them to said sense line, the register subsystem further placing address information in said service request word store identifying the register junctor used for the call requiring said further processing; further including detecting service request signals on said register subsystem sense line, in response thereto using said data transfer means to obtain the address information from said service request word store and scheduling further call processing to assign again a work area, placing the identity of the part of the call history table for the register junctor therein, and placing the identify of the last said work area in the call history table to thereby link them for use during said further call processing.
 3. In a communication switching system a method as claimed in claim 2, wherein a section of each said work area assigned for call processing is a register memory image area, the data processing unit responding to the detection of service request signals on said register subsystem sense line and using said data transfer means, reading information from certain of the control word stores and called number digit word stores of the register junctor for the call and placing the last said information in the assigned register memory image area for use by the data processing unit in processing for the call; wherein the processing steps in the data processing unit include analyzing digits, said analyzing including determining if enough called number digits have been received to complete a connection through the switching network to a terminal, and if not using said data transfer means to place processing information in a control word store of the register junctor, said processing information comprising an instruction to collect a specified total number of called number digits for the next generating of a service request signal applied to said register subsystem sense line, and releasing the last assigned work area after placing the last said information in a control word store.
 4. In a communication switching system a method as claimed in claim 3, wherein the register subsystem performs given operations in a relatively short time in response to certain instructions included in processing information received from the data processing unit until generation of a service request signal applied to said sense line; and when said certain instructions are included in processing information placed in a control word store of the register memory, retaining the work area then being used for the call while awaiting the next service request on said sense line for the call.
 5. In a communicatioN switching system a method as claimed in claim 3, wherein said data processing unit further includes an auxiliary memory system comprising an auxiliary memory, control storage means, and means to retrieve data from the auxiliary memory under control of data in the control storage means either by direct addressing or by associative search while the central processor is operating independently, there being class of service and called number translation tables in the auxiliary memory, memory control means coupling said central processor memory to the central processor and to the auxiliary memory system with means to transfer address and data information between the central processor and the central processor memory, and also to transfer address and data information between the auxiliary memory system and the central processor memory; wherein said step of finding class of service information relating to the calling line comprises deriving input information from said originating data message and supplying said input information via the memory control means into said first work area; further including the steps of supplying a signal to the auxiliary memory system to cause it to transfer information from the first work area to said control storage means, said retrieving data from the auxiliary memory being effective to obtain the class of service information, and transferring the last said information via the memory control means into first call storage means consisting of said first work area and the call history table; during processing steps when called number digits have been transferred from the register memory into current call storage means consisting of the then assigned work area and call history table for the call, performing a translation from said tables in the auxiliary memory and placing the resulting translation information in said current call storage means. 